Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution
نویسندگان
چکیده
We show near optimal bounds on the worst case quantum communication of single-shot entanglement-assisted one-way quantum communication protocols for the quantum state redistribution task and for the sub-tasks quantum state splitting and quantum state merging. Our bounds are tighter than previously known best bounds for the latter two sub-tasks. A key technical tool that we use is a convex-split lemma which may be of independent interest.
منابع مشابه
Quantum message compression with application to quantum state redistribution
We present a new scheme for the compression of one-way quantum messages, in the setting of coherent entanglement assisted quantum communication. For this, we present a new technical tool that we call the convex split lemma, which is inspired by the classical compression schemes that use rejection sampling procedure. As a consequence, we show new bounds on the quantum communication cost of singl...
متن کاملApproximate and Multipartite Quantum Correlation (Communication) Complexity
The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang (Proc. 3rd Innov Theor Comput., pp. 39-59, 2012). The former characterizes the minimal size of the initial shared state needed if no communicat...
متن کاملStructure, randomness and complexity in quantum computation
This thesis explores the interplay between structure and randomness in quantum computation, with the goal being to characterise the types of structure that give quantum computers an advantage over classical computation. The thesis begins by giving a necessary and sufficient condition for one notion of a quantum walk to be defined on a directed graph, and goes on to derive conditions on the stru...
متن کاملQuantum Information Complexity and Amortized Communication
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully quantum generalizations of the analogous quantities for bipartite classical functions that have found many applications recently, in particular for proving commun...
متن کاملOn optimal entanglement assisted one-shot classical communication
The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be sent via a single use of the channel. Prevedel et al. (PRL 106, 110505 (2011)) recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. We completely characteriz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.3031 شماره
صفحات -
تاریخ انتشار 2014